Modern developments of Shannon’s Chess
نویسنده
چکیده
We investigate some improvements and recent developments in the game-tree search techniques, which have influenced development of modern computer chess programs. We shall present an overview of various search heuristics to the basic Alpha-Beta (AB) pruning algorithm in order to achieve good move ordering (Iterative Deepening, Killer Heuristic, History Heuristic, Transposition Tables and Aspiration Windows), as well the improvements to the search algorithm itself (Scout, NegaScout, SSS*, MTD(f)). Finally, we take a brief glimpse into other directions of research (Conspiracy Numbers, Minmax approximations).
منابع مشابه
Auditory memory function in expert chess players
Background: Chess is a game that involves many aspects of high level cognition such as memory, attention, focus and problem solving. Long term practice of chess can improve cognition performances and behavioral skills. Auditory memory, as a kind of memory, can be influenced by strengthening processes following long term chess playing like other behavioral skills because of common processing pat...
متن کاملEvaluation-Function Factors
The heart of a chess program is its evaluation function, since it is this component which characterizes the style of play. A typical program evaluates a move by computing a weighted sum of the features that it considers. It is important to make the best selection of the relative weights of these features. They may be used not only to assess horizon nodes in the game tree, but also to order move...
متن کاملA Gamut of Games
work on how to program a computer to play chess. Since then, developing game-playing programs that can compete with (and even exceed) the abilities of the human world champions has been a long-sought-after goal of the AI research community. In Shannon’s time, it would have seemed unlikely that only a scant 50 years would be needed to develop programs that play world-class backgammon, checkers, ...
متن کاملThe Future of Chess - Playing Technologies and the Signi cance ofKasparov Versus Deep
In this paper we argue that the recent Garry Kasparov vs. Deep Blue matches are signiicant for the eld of artiicial intelligence in several ways, including providing an example of valuable baseline benchmarks for more complex alternatives to contrast and justify themselves. We will also brieey summarize some of the latest developments on computer chess research and highlight how our own work on...
متن کاملRemarks on Modern Track Geometry Maintenance
A short survey on modern track maintenance methods is given, concentrating on the developments in recent years. The ongoing refinement of the machinery should be shown as the influence of IT-solutions. On top the economic view to the track infrastructure is briefly demonstrated. Further developments in track hardware solutions must respect the obtained high level of track work mechanization. H...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006